package lanqiao;

import java.util.List;
import java.util.Scanner;

public class 打怪兽 {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int[] arr = new int[3];
        for (int i = 0; i < 3; i++) {
            arr[i] = scanner.nextInt();
        }
        int[] sort = sort(arr);
       int min= Math.abs(sort[0]-sort[2]);
        System.out.println(min);
    }
    public static int[] sort(int[] arr){

        for (int i = 0; i < arr.length; i++) {
            heapInsert(arr,i);
        }

        int size = arr.length;
        swap(arr,0,--size);
        while (size>0){
            heapfiy(arr,0,size);
            swap(arr,0,--size);
        }
        return arr;
    }
    public static void heapInsert(int[] arr,int index){
        while (arr[index]>arr[(index-1)/2]){
            swap(arr,index,(index-1)/2);
            index = (index-1)/2;
        }
    }
    public static void heapfiy(int[] arr,int index,int heapSize){
        int left = (index*2+1);
        while (left<heapSize){
            int largest = left+1<heapSize && arr[left+1]>arr[left] ? left+1:left;
            largest = arr[index] > arr[largest] ? index : largest;
            if (largest == index){
                break;
            }
            swap(arr,index,largest);
            index = largest;
            left = index*2+1;
        }
    }
    public static void swap(int[] arr, int l, int r) {
        int temp = arr[l];
        arr[l] = arr[r];
        arr[r] = temp;
    }
}
